- cost assignment path
- учет путь отнесения затрат* (связь между затратами и объектами затрат; базируется на определении счета возникновения затрат, и счета, на который они в конечном итоге будут отнесены)Syn:
Англо-русский экономический словарь.
cost assignment path
Смотреть что такое "cost assignment path" в других словарях:
Equal-cost multi-path routing — ECMP can also stand for Electronic Countermeasure Pod.Equal cost multi path routing (ECMP) is a routing strategy where next hop packet forwarding to a single destination can occur over multiple best paths which tie for top place in routing metric … Wikipedia
Route assignment — Route assignment, route choice, or traffic assignment concerns the selection of routes (alternative called paths) between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting… … Wikipedia
List of Fire Emblem: Path of Radiance characters — The group from Path of Radiance that appeared on Nasir s ship. Distinguished from left to right: Oscar, Rolf, Boyd, Mist, Mordecai, Lethe, Titania, Zihark, Rhys, Ike, Nephenee, Soren (front), Gatrie (back), Brom, Shinon, Mia (front), Marcia… … Wikipedia
Static single assignment form — In compiler design, static single assignment form (often abbreviated as SSA form or SSA) is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions , new… … Wikipedia
Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also … Wikipedia
Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
